Multiobjective Optimization Strategies for Linear Gradient Chromatography
نویسندگان
چکیده
The increase in the scale of preparative chromatographic processes for biopharmaceutical applications now necessitates the development of effective optimization strategies for large-scale processes in a manufacturing setting. The current state of the art for optimization of preparative chromatography has been limited to single objective functions. Further, there is a lack of understanding of when to use a particular objective, and how to combine and/or prioritize mutually competing objectives to achieve a true optimal solution. In this paper, these limitations are addressed by using a physical programming– based multiobjective optimization (MO) strategy. A set of Pareto solutions are first generated for model protein separations for both bi-objective (production rate and yield) and tri-objective (production rate, yield, and product pool concentration) scenarios. These Pareto frontiers are used to visualize the Pareto optimal surface for different components with various purity constraints and provide a qualitative framework to evaluate the optimal solutions. A physical programming–based multiobjective framework is then used for the quantitative evaluation of the optimal solutions for tertiary protein mixtures. This enables the interpretation of results for different sets of hierarchy and priority values assigned to the objective functions and constraints for the chromatographic processes. This novel multiobjective optimization approach computes the tradeoffs between the conflicting design objectives and helps in choosing an operating condition from infinite feasible optimal solutions. The combined quantitative and visualization framework presented in this paper sets the stage for the development of true optimal solutions for complex nonlinear preparative separations. © 2005 American Institute of Chemical Engineers AIChE J, 51: 511–525, 2005
منابع مشابه
Multiobjective optimization using evolutionary algorithms
Evolutionary algorithms (EAs) such as evolution strategies and genetic algorithms have become the method of choice for optimization problems that are too complex to be solved using deterministic techniques such as linear programming or gradient (Jacobian) methods. The large number of applications (Beasley (1997)) and the continuously growing interest in this field are due to several advantages ...
متن کاملA gradient-based multiobjective optimization technique using an adaptive weighting method
1. Abstract While various multiobjective optimization methods based on metaheuristic techniques have been proposed, these methods still encounter difficulties when handling many variables, or numerous objectives and constraints. This paper proposes a new aggregative gradient-based multiobjective optimization method for obtaining a Pareto-optimal solution set. In this method, the objective funct...
متن کاملAn infeasibility certificate for nonlinear programming based on Pareto criticality condition
This thesis proposes a new necessary condition for the infeasibility of non-linear optimization problems (that becomes necessary under convexity assumption) which is stated as a Pareto-criticality condition of an auxiliary multiobjective optimization problem. This condition can be evaluated, in a given problem, using multiobjective optimization algorithms, in a search that either leads to a fea...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملGradient projection and local region search for multiobjective optimisation
This paper presents a new method for multiobjective optimisation based on gradient projection and local region search. The gradient projection is conducted through the identi®cation of normal vectors of an ecient frontier. The projection of the gradient of a nonlinear utility function onto the tangent plane of the ecient frontier at a given ef®cient solution leads to the de®nition of a feasib...
متن کامل